#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e6;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL ans[maxn],cnt;
void init(){
    for(LL i=2;i<maxn;i++){
        ans[++cnt]=(i*i*i)-(i-1)*(i-1)*(i-1);
    }
}
int main(void)
{
  ///cin.tie(0);std::ios::sync_with_stdio(false);
  init();
  LL t;t=read();
  while(t--){
    LL n;n=read();
    bool flag=1;
    for(LL i=1;i<=cnt;i++){
        if(ans[i]==n){
            printf("YES\n");
            flag=0;
            break;
        }
        if(n<ans[i]) break;
    }
    if(flag==1) printf("NO\n");
  }
return 0;
}
